Dynamic Programming Used to Align Protein Structures with a Spectrum Is Robust
نویسندگان
چکیده
منابع مشابه
Dynamic Programming Used to Align Protein Structures with a Spectrum Is Robust
Several efficient algorithms to conduct pairwise comparisons among large databases of protein structures have emerged in the recent literature. The central theme is the design of a measure between the Cα atoms of two protein chains, from which dynamic programming is used to compute an alignment. The efficiency and efficacy of these algorithms allows large-scale computational studies that would ...
متن کاملPin-Align: A New Dynamic Programming Approach to Align Protein-Protein Interaction Networks
To date, few tools for aligning protein-protein interaction networks have been suggested. These tools typically find conserved interaction patterns using various local or global alignment algorithms. However, the improvement of the speed, scalability, simplification, and accuracy of network alignment tools is still the target of new researches. In this paper, we introduce Pin-Align, a new tool ...
متن کاملMM-align: a quick algorithm for aligning multiple-chain protein complex structures using iterative dynamic programming
Structural comparison of multiple-chain protein complexes is essential in many studies of protein-protein interactions. We develop a new algorithm, MM-align, for sequence-independent alignment of protein complex structures. The algorithm is built on a heuristic iteration of a modified Needleman-Wunsch dynamic programming (DP) algorithm, with the alignment score specified by the inter-complex re...
متن کاملRobust Dual Dynamic Programming
Multi-stage robust optimization problems, where the decision maker can dynamically react to consecutively observed realizations of the uncertain problem parameters, pose formidable theoretical and computational challenges. As a result, the existing solution approaches for this problem class typically determine suboptimal solutions under restrictive assumptions. In this paper, we propose a robus...
متن کاملDynamic programming approach to adjustable robust optimization
In this paper we consider the adjustable robust approach to multistage optimization, for which we derive dynamic programming equations. We also discuss this from a point of view of risk averse stochastic programming. As an example we consider a robust formulation of the classical inventory model and show that, similar to the risk neutral case, a basestock policy is optimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biology
سال: 2013
ISSN: 2079-7737
DOI: 10.3390/biology2041296